The Problem of Variable Selection for Financial Distress: Applying Grasp Metaheuristics

نویسندگان

  • Olga Gómez
  • Silvia Casado
  • Laura Nuñez
  • Joaquín Pacheco
چکیده

We use GRASP strategies to solve the problem of selecting financial ratios to model and predict business failure. As a previous step, we use the GRASP procedure to select a subset of financial ratios that are then used to estimate a model of logistic regression to anticipate finanical distress on a sample of Spanish firms. The algorithm we suggest is designed “ad-hoc” for this type of variables. Reducing dimensionality has several advantages (Inza et al. 2000) such as reducing the cost of data acquisition, bette r understanding of the final classification model, and increasing the efficiency and the efficacy. The application of t he GRASP procedure t o preselect a reduced subset of financial ratios g enerated better results than those obtained directly by applying a model of logistic regression to the set of the 141 original financial ratios.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Applying Combined Approach of Sequential Floating Forward Selection and Support Vector Machine to Predict Financial Distress of Listed Companies in Tehran Stock Exchange Market

Objective: Nowadays, financial distress prediction is one of the most important research issues in the field of risk management that has always been interesting to banks, companies, corporations, managers and investors. The main objective of this study is to develop a high performance predictive model and to compare the results with other commonly used models in financial distress prediction M...

متن کامل

Applying Variable Deletion Strategies in Bankruptcy Studies to Capture Common Information and Increase Their Reality

In financial distress studies selection of variable is commonly basedon the success of variables in variable sets employed in earlierbankruptcy studies, suggestions in the literature or an accompanyingdata reduction in a large set of variables. If seemingly different variablesets exhibit a strong relationship then heterogeneous variable setscapture common information. Canonical correlation anal...

متن کامل

Solving the flexible job shop problem by hybrid metaheuristics-based multiagent model

The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based c...

متن کامل

Assesing The Performance of Different S-Metaheuristics To Solve Unrestricted Parallel Identical Machines Scheduling Problem

In this paper we present a comparative study of four trajectory or single-solution based metaheuristics (S-metaheuristics): Iterated Local Search (ILS), Greedy Randomized Adaptive Search Procedure (GRASP), Variable Neighborhood Search (VNS), and Simulated Annealing (SA). These metaheuristics were considered to assess their respective performance to minimize the Maximum Tardiness (Tmax) for the ...

متن کامل

Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks

Variable neigborhood search (VNS) and Greedy randomized adaptive search procedure (GRASP) are among the well studied local search based metaheuristics providing good results for many combinatorial optimization problems throughout the last decade. While they are usually explored in different environments one may encounter quite obvious commonalities. Based on previous successful applications of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004